An Enhanced Hybrid Chaotic Algorithm using Cyclic Coordinate Search and Gradient Techniques
نویسندگان
چکیده
منابع مشابه
A Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
متن کاملDesign a Hybrid Recommender System Solving Cold-start Problem Using Clustering and Chaotic PSO Algorithm
One of the main challenges of increasing information in the new era, is to find information of interest in the mass of data. This important matter has been considered in the design of many sites that interact with users. Recommender systems have been considered to resolve this issue and have tried to help users to achieve their desired information; however, they face limitations. One of the mos...
متن کاملGeneralized Cyclic Open Shop Scheduling and a Hybrid Algorithm
In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However...
متن کاملEnhanced Security using Hybrid Encryption Algorithm
Information Security plays a major role in today’s scenario. Cloud computing is a technology that provides access to information and computing resources from anywhere that a network is available. There is a need to secure the data stored on cloud. The main goal behind the design of encryption algorithm must be security against unauthorized attacks. However, for all cloud computing applications,...
متن کاملA new hybrid conjugate gradient algorithm for unconstrained optimization
In this paper, a new hybrid conjugate gradient algorithm is proposed for solving unconstrained optimization problems. This new method can generate sufficient descent directions unrelated to any line search. Moreover, the global convergence of the proposed method is proved under the Wolfe line search. Numerical experiments are also presented to show the efficiency of the proposed algorithm, espe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista de Ingeniería
سال: 2010
ISSN: 0121-4993,2011-0049
DOI: 10.16924/revinge.32.5